JSM 2017 Online Program

Legend:
CC = Baltimore Convention Center, H = Hilton Baltimore
* = applied session ! = JSM meeting theme

Keyword Search Criteria: random graph returned 10 record(s)

Sunday, 07/30/2017

Community Detection and Invariance to Distribution
Guy Bresler, MIT; Wasim Huleihel, MIT
4:35 PM

Statistical Inference Problems in Growing Random Graphs
Miklos Z Racz, Microsoft Research
5:20 PM

Monday, 07/31/2017

Varying-Coefficient Models for Dynamic Networks
Jihui Lee, Columbia University; Gen Li, Columbia University; James D. Wilson, University of San Francisco

Varying-Coefficient Models for Dynamic Networks
Jihui Lee, Columbia University; Gen Li, Columbia University; James D. Wilson, University of San Francisco
9:15 AM

Dynamic Network Monitoring Using Random Graph Theory and Statistical Process Monitoring
James D. Wilson, University of San Francisco; Nathaniel Stevens, University of San Francisco; William H Woodall, Virginia Tech
11:35 AM

A Fast Scalable Procedure for Finding Change Points in Random Graphs
Mingyuan Gao, University of Florida; George Michailidis, University of Florida
12:05 PM

Exponential Random Graph Models with Big Networks: Maximum Pseudolikelihood Estimation and the Parametric Bootstrap
Christian Schmid, The Pennsylvania State University; Bruce Desmarais, The Pennsylvania State University
2:35 PM

Tuesday, 08/01/2017

Limit Theorems for Eigenvectors of the Normalized Laplacian for Random Graphs
Minh Tang, Johns Hopkins University; Carey E Priebe, Johns Hopkins University
11:15 AM

Thursday, 08/03/2017

Accounting for the Sampling Scheme in Network Modeling
Harry Crane, Rutgers University; Walter Dempsey, University of Michigan
11:35 AM

Supervised Community Detection in Dark Networks
Yulia R. Gel, University of Texas at Dallas; Yahui Tian, University of Texas at Dallas
11:35 AM